NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
931	Lattice Signatures Without Trapdoors Vadim Lyubashevsky INRIA / ENS, Paris Signature Schemes • Hash-and-Sign Add to Reading List Source URL: www.iacr.org Language: English - Date: 2012-04-20 07:04:19 NP-complete problems Error detection and correction Combinatorial optimization Dynamic programming Knapsack problem Hash function Ideal lattice cryptography Theoretical computer science Cryptography Applied mathematics
932	Performance Ratios for the Karmarkar-Karp Differencing Method Wil Michiels1 2 , Jan Korst2 , Emile Aarts1 2 , and Jan van Leeuwen3 1 Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands Add to Reading List Source URL: alexandria.tue.nl Language: English - Date: 2003-04-07 04:13:26 Subset sum problem Multiprocessor scheduling Applied mathematics NP-complete problems Theoretical computer science Dynamic programming Mathematical optimization
933	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
934	Combinatorial Reasoning in Information Theory Noga Alon∗ Abstract Combinatorial techniques play a crucial role in the investigation of problems in Information Theory. We describe a few representative examples, focusing Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2009-09-22 15:09:58 Graph coloring NP-complete problems Cartesian product of graphs Lovász number Graph theory Induced path Degeneracy
935	Journal of Artificial Intelligence Research[removed]Submitted 11/10; published[removed]Where Are the Hard Manipulation Problems? Toby Walsh Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2011-09-28 21:59:58 Voting Social choice theory Single winner electoral systems Mathematical optimization NP-hard NP-complete NP Computational complexity theory Instant-runoff voting Complexity classes Single Transferable Vote Political philosophy
936	An Efficient Spectral Bound for Link Vulnerability Assessment in Large-scale Networks Thang N. Dinh, Yilin Shen, and My T. Thai Dept. of Comp. & Info. Sci. & Eng. University of Florida Gainesville, FL, US, 32611 Add to Reading List Source URL: www.cise.ufl.edu Language: English - Date: 2012-09-04 09:52:44 Algebraic graph theory Spectral theory Matrix theory NP-complete problems Graph partition Eigenvalues and eigenvectors Connectivity Spectrum Eigenvalue algorithm Algebra Mathematics Linear algebra
937	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:50:59 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics
938	Elect. Comm. in Probab[removed]–90 ELECTRONIC COMMUNICATIONS in PROBABILITY Add to Reading List Source URL: www.emis.de Language: English - Date: 2011-12-25 21:18:15 Circle packing theorem Tree NP-complete problems Planar separator theorem Line graph Graph theory Mathematics Planar graphs
939	A Practical Parallel Algorithm for Cycle Detection in Partitioned Digraphs David A. Bader Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2009-02-15 11:12:53 Planar graph Tree Vertex NP-complete problems Graph coloring Line graph Pseudoforest Graph theory Graph operations Graph

UPDATE